The expected discrimination frequency for two-server queues
نویسندگان
چکیده
منابع مشابه
Two-parameter heavy-traffic limits for infinite-server queues
Abstract: In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic limits for two-parameter stochastic processes. We consider the random variables Qe(t, y) and Qr(t, y) representing the number of customers in the sys...
متن کاملTwo fluid approximations for multi-server queues with abandonments
Insight is provided into a previously developed M/M/s/r + M(n) approximation for the M/GI/s/r + GI queueing model by establishing fluid and diffusion limits for the approximating model. Fluid approximations for the two models are compared in the many-server efficiency-driven (overloaded) regime. The two fluid approximations do not coincide, but they are close. Short title: Fluid Approximations
متن کاملA Note on Convexity of the Expected Delay Cost in Single-Server Queues
In this note we show with an analytical counterexample that the expected delay cost for a G/G/1 queue is not necessarily convex in the arrival rate as sometimes claimed in the literature. We can prove, however, that the total expected delay cost rate is convex in the arrival rate. This cost rate is often of interest when designing queueing systems. Mathematics: Convexity. This note shows that t...
متن کاملGroup-Server Queues
From analyzing energy-efficient management of data centers, this paper proposes and develops a class of interesting Group-Server Queues, and establishes two representative group-server queues through loss networks and impatient customers, respectively. Furthermore, such two group-server queues are given model descriptions and necessary interpretation. Also, simple mathematical discussion is pro...
متن کاملstationary single-server queues
This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Perspectives
سال: 2018
ISSN: 2214-7160
DOI: 10.1016/j.orp.2018.06.001